Finding Unsatisfiable Subformulas with Stochastic Method
نویسندگان
چکیده
Explaining the causes of infeasibility of Boolean formulas has many practical applications in various fields. A small unsatisfiable subformula provides a succinct explanation of infeasibility and is valuable for applications. In recent years the problem of finding unsatisfiable subformulas has been addressed frequently by research works, which are mostly based on the SAT solvers with DPLL backtrack-search algorithm. However little attention has been concentrated on extraction of unsatisfiable subformulas using stochastic methods. In this paper, we propose a resolution-based stochastic local search algorithm to derive unsatisfiable subformulas. This approach directly constructs the resolution sequences for proving unsatisfiability with a local search procedure, and then extracts small unsatisfiable subformulas from the refutation traces. We report and analyze the experimental results on benchmarks.
منابع مشابه
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof
Explaining the causes of infeasibility of Boolean formulas has many practical applications in various fields. A small unsatisfiable subformula provides a succinct explanation of infeasibility and is valuable for applications. In recent years finding unsatisfiable subformulas has been addressed frequently by research works, mostly based on the SAT solvers with DPLL backtrack-search algorithm. Ho...
متن کاملOn Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the problem, strongly linking it to the maximal satisfiability problem. From this relationship, we have developed a novel technique for extracting all MUSes of a CNF formula, tightly integrating our implementation with a...
متن کاملOn Partitioning for Maximum Satisfiability
Partitioning formulas is motivated by the expectation to identify easy to solve subformulas, even though at the cost of having more formulas to solve. In this paper we suggest to apply partitioning to Maximum Satisfiability (MaxSAT), the optimization version of the well-known Satisfiability (SAT) problem. The use of partitions can be naturally combined with unsatisfiability-based algorithms for...
متن کاملφ φ φ φ φ φ k From Max - SAT to Min - UNSAT : Insights and Applications
This report describes a strong connection between maximum satisfiability and minimally-unsatisfiable subfor-mulas of any constraint system, as well as techniques for exploiting it. Focusing on CNF formulas, we explore this relationship and present novel algorithms for extracting minimally-unsatisfiable subformulas, including one that finds all such subformulas. We present experimental results s...
متن کاملRefining Unsatisfiable Cores in Incremental SAT Solving
Incremental SAT solving is used in many applications in the area of electronic design automation. The extraction of unsatisfiable subformulas of a propositional logic formula, as used in verification tools and MaxSAT algorithms, is an important feature. In this work we propose a simple refinement strategy for extracting unsatisfiable subformulas, which does not produce minimal subformulas, but ...
متن کامل